Optimal Homography Computation with a Reliability Measure
نویسنده
چکیده
normalization to make the Z component 1. In order This paper describes an algorithm for optimally cornto remove scale we the norputing the homography between two given sets of points 1' = ', where the norm of matrix on a plane and evaluating the reliability of the result= ( H i j ) is defined by IlHll = d m . ing mapping. The basic principle is maximum likelihood We regard data points as random variables. Let estimation by a technique called renormalization. X, and Xb, be the covariance matrices of points (x,, y,) and (xb,, y;), respectively. The covariance
منابع مشابه
Accuracy Bounds and Optimal Computation of Homography for Image Mosaicing Applications
We describe a theoretically optimal algorithm for computing the homography between two images in relation to image mosaicing applications. First, we derive a theoretical accuracy bound based on a mathematical model of image noise and do simulation to con rm that our renormalization technique e ectively attains that bound; our algorithm is optimal in that sense. Then, we apply our technique to m...
متن کاملHigh Accuracy Homography Computation without Iterations
We present a highly accurate least-squares (LS) alternative to the theoretically optimal maximum likelihood (ML) estimator for homographies between two images. Unlike ML, our estimator is non-iterative and yields a solution even in the presence of large noise. By rigorous error analysis, we derive a “hyperLS” estimator which is unbiased up to second order noise terms. We also introduce a comput...
متن کاملHomography-based 2D Visual Tracking and Servoing
The objective of this paper is to propose a new homography-based approach to image-based visual tracking and servoing. The visual tracking algorithm proposed in the paper is based on a new efficient second-order minimization method. Theoretical analysis and comparative experiments with other tracking approaches show that the proposed method has a higher convergence rate than standard first-orde...
متن کاملComputing Homographies from Three Lines or Points in an Image Pair
This paper deals with the computation of homographies from two views in a multi-plane scene. In the general case, homographies can be determined using four matched points or lines belonging to planes. We propose an alternative method when a first homography has been obtained, and then three matches are sufficient to compute a second homography. This process is based on the geometric constraint ...
متن کاملPlane-based Calibration of a Camera with Varying Focal Length: the Centre Line Constraint
This paper deals with the problem of calibrating a (moving) camera with varying focal length, from n views of a planar pattern with a known Euclidean structure. The main issue under discussion is to find a new method whose complexity does not dramatically increase with the number n of views, contrary to existing methods. Our contribution is to relate this calibration problem to the Centre Line ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998